منابع مشابه
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s ∈ V and a set M ⊆ V − {s} of terminals with a nonnegative demand q(v), v ∈ M , we wish to find a collection T = {T1, T2, . . . , T`} of trees rooted at s to send all the demands to s, where the total demand collected by each tree Ti...
متن کاملOn the Generalized Arc Routing Problem
In this work we study the Generalized Arc Routing Problem (GARP) on an undirected graph. In the GARP a given graph is partitioned into clusters and a route is sought that traverses at least one edge of each cluster. Broadly speaking, the GARP is the arc routing counterpart of the Generalized Traveling Salesman Problem (GTSP). In the GTSP the set of vertices of a given graph is partitioned into ...
متن کاملA New Efficient Transformation of the Generalized Vehicle Routing Problem into the Classical Vehicle Routing Problem
Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets. In the literature one can find generalized problems such as: generalized minimum spanning tree, generalized traveling salesman problem, generalized Steiner tree problem, generalized vehicle routing problem, etc...
متن کاملOn the approximation of the generalized capacitated tree-routing problem
Let G=(V,E) be a connected graph such that each edge e in E is weighted by a nonnegative real w(e). Let s be a vertex designated as a sink, M subset of V be a set of terminals with a demand function q:MR +, k>0 be a routing capacity, and λ≥1 be an integer edge capacity. The capacitated tree-routing problem (CTR) asks to find a partition M={Z 1,Z 2,...,Z l } of M and a set T={T1,T2,...,Tl} of tr...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90069-7